- 1 - Random Mapping Statistics
نویسنده
چکیده
Random mappings from a nite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out: These parameters are studied systematically through the use of generating functions and singularity analysis. In particular, an open problem of Knuth is solved, namely that of nding the expected diameter of a random mapping. The same approach is applicable to a larger class of discrete combinatorial models and possibilities of automated analysis using symbolic manipulation systems (\computer algebra") are also brie y discussed.
منابع مشابه
Applications of Random Fields in Human Brain Mapping
The goal of this short article is to summarize how random field theory has been used to test for activations in brain mapping applications. It is intended to be a general discussion and hence it is not very specific to individual applications. Tables of most widely used random fields, examples of their applications, as well as references to distributions of some of their relevant statistics are...
متن کاملMapping Dieback Intensity Distribution in Zagros Oak Forests Using Geo-statistics and Artificial Neural Network
The first and most important issue in forest drought management is knowledge of the location and severity of forest decline. In this regard, we used geostatistics and artificial neural network methods to map the dieback intensity of oak forests in the Ilam province, Iran. We used a systematic random sampling with a 250 × 200 m grid to establish 100 plots, each covering 1200 m2. The percentage ...
متن کاملA new random mapping model
In this paper we introduce a new random mapping model, T D̂ n , which maps the set {1, 2, ..., n} into itself. The random mapping T D̂ n is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequence for the vertices is given by the variables D̂1, D̂2, ..., D̂n, an...
متن کاملA cutting process for random mappings
In this paper we consider a cutting process for random mappings. Specifically, for 0 < m < n, we consider the initial (uniform) random mapping digraph Gn on n labelled vertices, and we delete (if possible), uniformly and at random, m non-cyclic directed edges from Gn. The maximal random digraph consisting of the uni-cyclic components obtained after cutting the m edges is called the trimmed rand...
متن کاملLocal properties of a random mapping model
In this paper we investigate the ‘local’ properties of a random mapping model, T D̂ n , which maps the set {1, 2, ..., n} into itself. The random mapping T D̂ n was introduced in a companion paper [?] is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequenc...
متن کامل